Treasure Hunt *

نویسندگان

  • Markus M. Möbius
  • Tuan Phan
  • Adam Szeidl
  • Abhijit Banerjee
  • Ben Golub
چکیده

We seed a large real-world social network with binary information and analyze subsequent social learning. A unique feature of our field experiment is that we measure both the pre-existing social networks and the actual conversation network. Our experiment allows us to test how rational agents behave when processing information that originates within their social network. We find that information decays quickly with social distance and that agents mainly incorporate information within social distance 2. Conversations trough common friends do not increase the weight that a subject places on signals from direct friends but linearly increases the weight on signals from indirect friends. This suggests that agents are able to avoid double-counting information from indirect friends. We propose a simple “streams model” of social learning that is consistent with the evidence from our experiment. JEL Classification: C91, C93, D83

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Influencing the Learning Experience Through Affective Agent Feedback in a Real-World Treasure Hunt: (Extended Abstract)

We explore the effect of the behaviour of a virtual robot agent in the context of a real-world treasure-hunt activity carried out by children aged 11–12. We compare three conditions: a traditional paper-based treasure hunt, along with a virtual robot on a tablet which provides either neutral or affective feedback during the treasure hunt. The results of the study suggest that the use of the vir...

متن کامل

A Treasure Hunt With An Empathic Virtual Tutor: (Demonstration)

We present a demonstration of a Treasure Hunt Application with an Empathic Virtual Tutor. During the treasure hunt, this empathic agent adapts its interaction based on the affective state of the user to improve learning experience. We demonstrate the application domain; the technology used; and the app focusing on the empathic strategies applied.

متن کامل

Information-driven Sensor Path Planning and the Treasure Hunt Problem

Engineering—Mechanical) INFORMATION-DRIVEN SENSOR PATH PLANNING AND THE TREASURE HUNT PROBLEM by Chenghui Cai Department of Mechanical Engineering and Materials Science Duke University

متن کامل

Faster Treasure Hunt and Better Strongly Universal Exploration Sequences

In this paper, we investigate the explicit deterministic treasure hunt problem in a n-vertex network. This problem was firstly introduced by Ta-Shma and Zwick in [10] [SODA’07]. Note also it is a variant of the well known rendezvous problem in which one of the robot (the treasure) is always stationary. In this paper, we propose an O(n 1 λ )-time algorithm for the treasure hunt problem, which si...

متن کامل

Affective Agents

This paper presents a study designed to explore the effect of feedback on perception of an embodied agent as well as the overall performance and experience of primary school children aged 12-13 carrying out a treasure hunt activity. We use an embodied agent to compare three experimental conditions: no feedback, neutral feedback, and affective feedback. What the students think about the embodied...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010